Round trinomials

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Root Separation for Trinomials

We give a separation bound for the complex roots of a trinomial f ∈ Z[X ]. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of f ; in particular, it is polynomial in log(deg f). It is known that no such bound is possible for 4-nomials (polynomials with 4 monomials). For trinomials, the classical results (which are based on the degree of f rat...

متن کامل

Twelve New Primitive Binary Trinomials

We exhibit twelve new primitive trinomials over GF(2) of record degrees 42 643 801, 43 112 609, and 74 207 281. In addition we report the first Mersenne exponent not ruled out by Swan’s theorem [10] — namely 57 885 161 — for which none primitive trinomial exists. This completes the search for the currently known Mersenne prime exponents. Primitive trinomials of degree up to 32 582 657 were repo...

متن کامل

Factorization of Trinomials over Galoisfields

We study the parity of the number of irreducible factors of trinomials over Galois elds of characteristic 2. As a consequence , some suucient conditions for a trinomial being reducible are obtained. For example, x n + ax k + b 2 GF (2 t))x] is reducible if both n; t are even, except possibly when n = 2k, k odd. The case t = 1 was treated by R.G.Swan 10], who showed that x n + x k + 1 is reducib...

متن کامل

Norms of Roots of Trinomials

(a) f has two distinct roots with identical norm v if and only if p is located on a real double point of the hypotrochoid, (b) f has a root of multiplicity 2 with norm v if and only if the corresponding hypotrochoid is a hypocycloid and p is a cusp of it, and (c) f has more than two roots with norm v if and only if p = 0 if and only if the hypotrochoid is a rhodonea curve with a multiple point ...

متن کامل

Mastrovito Multiplier for All Trinomials

An efficient algorithm for the multiplication in GF (2) was introduced by Mastrovito. The space complexity of the Mastrovito multiplier for the irreducible trinomial x +x+1 was given as m − 1 XOR and m AND gates. In this paper, we describe an architecture based on a new formulation of the multiplication matrix, and show that the Mastrovito multiplier for the generating trinomial x + x + 1, wher...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1981

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1981.96.175